Graph Coloring on a Coarse Grained Multiprocessor
نویسندگان
چکیده
We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most ∆G +1 colors.
منابع مشابه
Evaluation of static scheduling algorithms improved with partial strict triggering of program graph nodes
The problem of multiprocessor scheduling can be stated as finding a schedule for a general program graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NP-hard and heuristic algorithms have been proposed to obtain optimal and sub optimal solutions. Almost all coarse grained program graph nodes dont need all of thei...
متن کاملGraph coloring on coarse grained multicomputers
We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most ∆+1 colors where ∆ is the maximum degree in G. This algorithm is given in two variants: a randomized and a deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O( |G| p ) and a total work and overall communication cost...
متن کاملScalable Coarse Grained Parallel Interval Graph Algorithms
We present scalable coarse grained parallel algorithms for solving interval graph problems on a BSP-like model{Coarse Grained Multicomputers (CGM). The problems we consider include: nding maximum independent set, maximum weighted clique, minimum coloring and cut vertices and bridges. With scalability at n p p ; 8 > 0 (here n denotes the total input size and p the number of processors), our algo...
متن کاملDeterministic Parallel Graph Coloring with Repartitioning by Auxiliary Graph Coloring
In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and auxiliary graph coloring. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various relevant deterministic graph coloring algorithms. Q...
متن کاملDeterministic Parallel Graph Coloring with Symmetry Breaking
In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and symmetry breaking. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various deterministic graph coloring algorithms. Quantified result...
متن کامل